integrating case-based reasoning, knowledge-based approach and tsp algorithm for minimum tour finding

imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long for the algorithm to find the shortest path. furthermore, in reality, things are not as simple as those stated in at. for instance, the cost of travel for the same part of the city at different times may not be the same. in this project, we have integrated tsp algorithm with ai knowledge-based approach and case-based reasoning in solving the problem. with this integration, knowledge about the geographical information and past cases are used to help tsp algorithm in finding a solution. this approach dramatically reduces the computation time required for minimum tour finding.